e-Learn @ SASTRA Back

Introduction & Role of Algorithms in computing

Role of Alg_2 & Analysis of Alg

Analysis of Alg

Analysis of Alg

Analysis of algorithm

Analysis of algorithm

Designing Algorithms

Designing algorithms

designing algorithms & growth of functions

Growth of functions & Maximum sub array

Divide & conquer & recurrence solving

Recurrence solving methods

Divide and conquer Matrix Multiplication

Sorting-Heapsort

Sorting-Heapsort Analysis

Sorting-Quicksort

Quicksort

Non-comparison(linear time) sorting

Linear time sorting

Bucket sort Expected running time& Dynamic Programming

Rod Cutting

Rod Cutting

Rod cutting

Matrix Chain Multiplication

LCS

LCS

Greedy-Activity Selection Problem

Activity selection problem

Greedy-Huffman

Correctness of Huffman

Knapsack Problem

BFS

DFS

Lec33:Topological sort & Kruskal alg(MST)

Lec34:Prims algorithm(MST)

Lec35:Dijkstra Algorithm

Lec36:Floyd warshall

Lec36:Floydwarshall

Lec37:Bellman-Ford Algorithm

Lec38:Patter Matching

Lec39:Pattern matching

Lec40:Knuth-Morris Pratt(KMP)

Lec41:KMP

Unit-4 Revision 1

Unit-4 Revision-2

Unit-4 Revision 3

Unit-4 Q&A

Revision Unit4 MCQ Answer

MCQ 1 & descriptive 1 discussion

MCQ-2 & descriptive -2 discussion